Minimum permanents on certain faces of matrices containing an identity submatrix
نویسندگان
چکیده
منابع مشابه
Minimum permanents on two faces of the polytope of doubly stochastic matrices∗
We consider the minimum permanents and minimising matrices on the faces of the polytope of doubly stochastic matrices whose nonzero entries coincide with those of, respectively, Um,n = [ In Jn,m Jm,n 0m ] and Vm,n = [ In Jn,m Jm,n Jm,m ] . We conjecture that Vm,n is cohesive but not barycentric for 1 < n < m + √ m and that it is not cohesive for n > m + √ m. We prove that it is cohesive for 1 <...
متن کاملAn Inequality for Permanents of (0,1)-Matrices*
Let A be an n-square (0, 1)-matrix, let ri denote the i-th row sum of A, i = 1 ..... n, and let per(A) denote the permanent of A. Then per(A) ~< H ri q~/-2,.1 I + V T where equality can occur if and only if there exist permutation matrices P and Q such that PAQ is a direct sum of l-square and 2-square matrices all of whose entries are 1. I f A = (ai~) is an n-square mat r ix then the permanent ...
متن کاملOn Permanents of Sylvester Hadamard Matrices
It is well-known that a Sylvester Hadamard matrix can be described by means of a cocycle. In this paper it is shown that the additional internal structure in a Sylvester Hadamard matrix, provided by the cocycle, is su cient to guarantee some kind of reduction in the computational complexity of calculating its permanent using Ryser's formula. A Hadamard matrix H of order n is an n× n matrix with...
متن کاملOn the Permanents of Complements of the Direct Sum of identity Matrices
A classic experiment used in testing for ESP abilities has the following general form. A deck of cards, consisting of a, identical cards of type i, 1 I i I r, is shuffled and placed face down (in most such experiments r = 5 and a, = 5 for 1 I i _( 5). The subject then attempts to correctly guess the type of each card as the cards are sequentially removed from the deck. In previous work [2,3], s...
متن کاملAddendum To Schrijver's Work On Minimum Permanents
Let ∆n denote the set of n×n matrices of non-negative integers which have each row and column sum equal to k. Let Λn denote the subset of all binary matrices (matrices of zeroes and ones) in ∆n. If G is a bipartite multigraph let B(G) denote the usual ‘biadjacency’ matrix of G. That is, B(G) is the matrix with rows and columns respectively corresponding to the vertices in the two parts of G, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1988
ISSN: 0024-3795
DOI: 10.1016/0024-3795(88)90192-9